Chordal Directed Graphs Are Not $\chi$-Bounded
نویسندگان
چکیده
We show that digraphs with no transitive tournament on $3$ vertices and in which every induced directed cycle has length can have arbitrarily large dichromatic number. This answers the negative a question of Carbonero, Hompe, Moore, Spirkl (and strengthens one their results).
منابع مشابه
Outerstring graphs are chi-bounded
An outerstring graph is an intersection graph of curves lying in a halfplane with one endpoint on the boundary of the halfplane. It is proved that the outerstring graphs are χ-bounded, that is, their chromatic number is bounded by a function of their clique number. This generalizes a series of previous results on χ-boundedness of outerstring graphs with various restrictions of the shape of the ...
متن کاملLinear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage
The directed vertex leafage of a chordal graph G is the smallest integer k such that G is the intersection graph of subtrees of a rooted directed tree where each subtree has at most k leaves. In this note, we show how to find in time O(kn) an optimal colouring, a maximum independent set, a maximum clique, and an optimal clique cover of an n-vertex chordal graph G with directed vertex leafage k ...
متن کاملHamiltonian chordal graphs are not cycle extendible
In 1990, Hendry conjectured that every Hamiltonian chordal graph is cycle extendible; that is, the vertices of any non-Hamiltonian cycle are contained in a cycle of length one greater. We disprove this conjecture by constructing counterexamples on n vertices for any n ≥ 15. Furthermore, we show that there exist counterexamples where the ratio of the length of a non-extendible cycle to the total...
متن کاملOn Strongly Chordal Graphs That Are Not Leaf Powers
A common task in phylogenetics is to find an evolutionary tree representing proximity relationships between species. This motivates the notion of leaf powers: a graph G = (V,E) is a leaf power if there exist a tree T on leafset V and a threshold k such that uv ∈ E if and only if the distance between u and v in T is at most k. Characterizing leaf powers is a challenging open problem, along with ...
متن کاملChordal Graphs are Fully Orientable
Suppose that D is an acyclic orientation of a graph G. An arc of D is called dependent if its reversal creates a directed cycle. Let dmin(G) (dmax(G)) denote the minimum (maximum) of the number of dependent arcs over all acyclic orientations of G. We call G fully orientable if G has an acyclic orientation with exactly d dependent arcs for every d satisfying dmin(G) 6 d 6 dmax(G). A graph G is c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Combinatorics
سال: 2022
ISSN: ['1077-8926', '1097-1440']
DOI: https://doi.org/10.37236/11050